Jacobi-Davidson Methods for Symmetric Eigenproblems

نویسنده

  • Henk van der Vorst
چکیده

1 Why and how The Lanczos method is quite eeective if the desired eigenvalue is either max or min and if this eigenvalue is relatively well separated from the remaining spectrum, or when the method is applied with (A ? I) ?1 , for some reasonable guess for an eigenvalue. If none of these conditions is fulllled, for instance the computation of a vector (A ? I) ?1 y for given y may be computationally unattractive, then variants of the Jacobi-Davidson method 8] ooer an attractive alternative. The Jacobi-Davidson method is based on a combination of two basic principles. The rst one is to apply a Ritz-Galerkin approach for the eigenproblem Ax = x, with respect to some given subspace spanned by v 1 , : : :, v k. The usage of other than Krylov subspaces was suggested by Davidson 2] who also suggested speciic choices, diierent from the ones that we will take, for the construction of orthonormal basis vectors v j. The Ritz-Galerkin condition is which leads to the reduced system V k AV k s ? s = 0: (1) This equation has k solutions ((k) j ; s (k) j). The k pairs ((k) j ; z (k) j V k s (k) j) are called the Ritz values and Ritz vectors, respectively, of A with respect to the subspace spanned by the v j. These Ritz pairs are approximations for eigenpairs of A, and our goal is to get better approximations by a well-chosen expansion of the subspace. At this point the other principle behind the Jacobi-Davidson approach comes into the play. The idea goes back to Jacobi 4]. Suppose that we have an eigenvector approximation z (k) j for an eigenvector corresponding to given eigenvalue. Then Jacobi suggested (in the original paper for strongly diagonally dominant matrices) to compute the orthogonal correction t for z (k) j so that A(z (k) j + t) = (z (k) j + t): Since t ? z (k) j , we can restrict ourselves to the subspace orthogonal to z (k) j. The operator A restricted to that subspace is given by (I ? z (k) j z (k) j)A(I ? z (k) j z (k) j); and we nd that t satisses the equation (I ? z (k) j z (k) j)(A ? I)(I ? z (k) j z (k) j)t = ?(A ? I)z …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Controlling Inner Iterations in the Jacobi-Davidson Method

The Jacobi–Davidson method is an eigenvalue solver which uses the iterative (and in general inaccurate) solution of inner linear systems to progress, in an outer iteration, towards a particular solution of the eigenproblem. In this paper we prove a relation between the residual norm of the inner linear system and the residual norm of the eigenvalue problem. We show that the latter may be estima...

متن کامل

A New Justification of the Jacobi–davidson Method for Large Eigenproblems

The Jacobi–Davidson method is known to converge at least quadratically if the correction equation is solved exactly, and it is common experience that the fast convergence is maintained if the correction equation is solved only approximately. In this note we derive the Jacobi–Davidson method in a way that explains this robust behavior.

متن کامل

Projection Methods for Nonlinear Sparse Eigenvalue Problems

This paper surveys numerical methods for general sparse nonlinear eigenvalue problems with special emphasis on iterative projection methods like Jacobi–Davidson, Arnoldi or rational Krylov methods and the automated multi–level substructuring. We do not review the rich literature on polynomial eigenproblems which take advantage of a linearization of the problem.

متن کامل

A Jacobi-Davidson Method for Nonlinear Eigenproblems

For the nonlinear eigenvalue problem T (λ)x = 0 we consider a Jacobi–Davidson type iterative projection method. The resulting projected nonlinear eigenvalue problems are solved by inverse iteration. The method is applied to a rational eigenvalue problem governing damped vibrations of a structure.

متن کامل

A Chebyshev-Davidson Algorithm for Large Symmetric Eigenproblems

A polynomial filtered Davidson-type algorithm is proposed for symmetric eigenproblems, in which the correction-equation of the Davidson approach is replaced by a polynomial filtering step. The new approach has better global convergence and robustness properties when compared with standard Davidson-type methods. The typical filter used in this paper is based on Chebyshev polynomials. The goal of...

متن کامل

A Jacobi-Davidson-type projection method for nonlinear eigenvalue problems

This article discusses a projection method for nonlinear eigenvalue problems. The subspace of approximants is constructed by a Jacobi–Davidson type approach, and the arising eigenproblems of small dimension are solved by safeguarded iteration. The method is applied to a rational eigenvalue problem governing the vibrations of tube bundle immersed in an inviscid compressible fluid.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007